The Subtree Size Profile of Bucket Recursive Trees
author
Abstract:
Kazemi (2014) introduced a new version of bucket recursive trees as another generalization of recursive trees where buckets have variable capacities. In this paper, we get the $p$-th factorial moments of the random variable $S_{n,1}$ which counts the number of subtrees size-1 profile (leaves) and show a phase change of this random variable. These can be obtained by solving a first order partial differential equation for the generating function correspond to this quantity.
similar resources
The Subtree Size Profile of Plane-oriented Recursive Trees
In this extended abstract, we outline how to derive limit theorems for the number of subtrees of size k on the fringe of random plane-oriented recursive trees. Our proofs are based on the method of moments, where a complex-analytic approach is used for constant k and an elementary approach for k which varies with n. Our approach is of some generality and can be applied to other simple classes o...
full textThe eccentric connectivity index of bucket recursive trees
If $G$ is a connected graph with vertex set $V$, then the eccentric connectivity index of $G$, $xi^c(G)$, is defined as $sum_{vin V(G)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. In this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.
full textLimit Theorems for Subtree Size Profiles: Plane-oriented Recursive Trees
We investigate the number of subtrees of size k on the fringe of plane-oriented recursive trees. We use a complex-analytic method to derive precise expansions of mean value and variance as well as a central limit theorem for fixed k. Moreover, we use an elementary approach to derive limit laws when k is growing with n. Our approaches are of some generality and can be applied to other simple cla...
full textthe eccentric connectivity index of bucket recursive trees
if $g$ is a connected graph with vertex set $v$, then the eccentric connectivity index of $g$, $xi^c(g)$, is defined as $sum_{vin v(g)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. in this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.
full textRandomization of Search Trees by Subtree Size
In this paper we present probabilistic algorithms over random binary search trees such that: a) the insertion of a set of keys in any xed order into an initially empty tree produces always a random tree; b) the deletion of any key of a random tree results in a random tree; c) the random choices made by the algorithms are based upon the sizes of the subtrees of the random tree, an information th...
full textA combinatorial approach to the analysis of bucket recursive trees
In this work we provide a combinatorial analysis of bucket recursive trees, which have been introduced previously as a natural generalization of the growth model of recursive trees. Our analysis is based on the description of bucket recursive trees as a special instance of so called bucket increasing trees, which is a family of combinatorial objects introduced in this paper. Using this combinat...
full textMy Resources
Journal title
volume 11 issue None
pages 1- 11
publication date 2016-04
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023